generalized convexity造句
例句与造句
- Generalized increasing - decreasing functions and generalized convexity of the compound functions
递减函数与复合函数的广义凸性 - Quasiconvex functions and various generalized convexity of functions play important roles in mathematical programming
拟凸函数及函数的各种广义凸性，在数学规划中起着重要作用。 - Under the assuption of - generalized convexity , relative interior is introduced , and a farkas - minkowski type alternative theorem is proved
在-广义锥凸性假设下，引进相对内部，证明了farkas - minkowski型的择一性定理。 - This paper discusses four sufficient optimality conditions for nonsmooth continuous - time nonliear multiobjective optimization problems under generalized convexity assumptions
在广义凸性假设下,讨论了非光滑连续时间非线性多目标优化问题的四个最优性充分条件。 - Abstract : using the definitions of semi - locally star shaped set and generalized convexity for vector functions . we discuss the existence of efficient solutions for generalized multiobjective programming
文摘:本文利用1中的半局部星状集和向量函数的广义凸性，讨论了一类广义多目标规划有效解的存在性。 - It's difficult to find generalized convexity in a sentence. 用generalized convexity造句挺难的
- Under generalized convexity assumptions , necessary and sufficient conditions of optimality are obtained for nonsmooth nonlinear optimization problems . moreover , dual model is established and duality results are obtained
在函数广义凸意义下，获得了非光滑非线性优化问题的最优性必要条件和充分条件，建立了问题的对偶模型并得到对偶结果 - Abstract : under generalized convexity assumptions , necessary and sufficient conditions of optimality are obtained for nonsmooth nonlinear optimization problems . moreover , dual model is established and duality results are obtained
文摘:在函数广义凸意义下，获得了非光滑非线性优化问题的最优性必要条件和充分条件，建立了问题的对偶模型并得到对偶结果 - Under the assuption of generalized subconvexlikeness , the optimality conditions of set - valued optimization problems in linear space are established by using obtained gordan - farkas type alternative theorem . under the assuption of near subconvexlikeness and - generalized convexity , the optimality conditions of set - valued optimization problems in linear topological space are established by using alternative theorem of near subconvexlikeness and obtained farkas - minkowski type alternative theorem . the concepts of super efficient solution and - super efficient solution are defined in normed space , and the optimality conditions of set - valued optimization problems are established under the assuption of semi - preinvexity
在广义次似凸性假设下，利用已获得的gordan - farkas型的择一性定理，建立了线性空间中集值优化问题的最优性条件。在近次似凸和-广义锥凸性假设下，利用近次似凸集值映射的择一性定理和已获得的farkas - minkowski型的择一性定理，建立了线性拓扑空间中集值优化问题的最优性条件。